count of paths from A[a,b] to A[c,d] without duplicating?

Posted by Sorush Rabiee on Stack Overflow See other posts from Stack Overflow or by Sorush Rabiee
Published on 2010-03-23T14:56:35Z Indexed on 2010/03/23 15:03 UTC
Read the original article Hit count: 308

I write a sokoban solver for fun and practice, it uses a simple algorithm (something like BFS).

now i want to estimate its running time ( O and omega). but i need to know how to calculate count of paths from a vertex to another in a network. each path from a to b is a sequence of edges with no circuit.

for example this is a correct path:

http://www.imgplace.com/viewimg143/4789/501k.png

but this is not:

http://www.imgplace.com/viewimg143/6140/202.png

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about discrete-mathematics